Computational Progress towards Maximum Distinguishability of Bell States by Linear Evolution and Local Measurement

نویسندگان

  • Victor Shang
  • Harvey Mudd
  • Theresa W. Lynn
  • Andrew J. Bernoff
چکیده

Many quantum information protocols rely on the ability to distinguish between entangled quantum states known as Bell states. However, theoretical limits exist on the maximal distinguishability of these entangled states using linear evolution and local measurement (LELM) devices. In the case of two particles entangled in multiple qubit variables, the maximum number of distinguishable Bell states is known. However, in the more general case of two particles entangled in multiple qudit variables, only an upper bound is known under additional assumptions. I have written software in Matlab andMathematica to explore computationally the maximum number of Bell states that can be distinguished in the case of two particles entangled in a qutrit variable, and the case of two particles entangled in both a qutrit and qubit variable. Using code I have written in Mathematica, I have reduced the number of cases to check for sets of 9 qubit⊗qutrit Bell states from 94, 143, 280 to 10, 365. Further work needs to be done to computationally check these cases for distinguishability by an LELM apparatus.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ua nt - p h / 03 04 18 4 v 2 3 M ay 2 00 3 Bell States , Dense Coding , and Teleportation

The problem of the distinguishability of the Bell states is considered. In the entangled Bell states the individual particles are a mixture. The implication of this for " local interpretation " of the dense coding and teleportation protocols is examined.

متن کامل

ua nt - p h / 02 08 05 9 v 1 9 A ug 2 00 2 Criterion for local distinguishability of arbitrary bipartite orthogonal states Ping -

In this paper we present a necessary and sufficient condition of distinguishability of bipartite quantum states. It is shown that the operators to reliably distinguish states need only rounds of projective measurements and classical comunication. We also present a necessary condition of distinguishability of bipartite quantum states which is simple and general. With this condition one can get m...

متن کامل

ua nt - p h / 02 08 05 9 v 2 1 2 A ug 2 00 2 Criterion for local distinguishability of arbitrary bipartite orthogonal states

In this paper we present a necessary and sufficient condition of distinguishability of bipartite quantum states. It is shown that the operators to reliably distinguish states need only rounds of projective measurements and classical comunication. We also present a necessary condition of distinguishability of bipartite quantum states which is simple and general. With this condition one can get m...

متن کامل

DISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA

In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...

متن کامل

The local distinguishability of any three generalized Bell states

We study the problem of distinguishing maximally entangled quantum states by using local operations and classical communication (LOCC). A question of fundamental interest is whether any three maximally entangled states in C ⊗ C(d ≥ 4) are distinguishable by LOCC. In this paper, we restrict ourselves to consider the generalized Bell states. And we prove that any three generalized Bell states in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017